Shift Register Synthesis (Modulo m)
نویسندگان
چکیده
منابع مشابه
Shift-Register Synthesis (Modula m)
The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback shift register) that can generate the sequence. In this paper we extend the algorithm to the case when the elements of the sequence are integers modulo m, where m is an arbitrary integer with known prime decomposition.
متن کاملShift - Register Synthesis and BCH Decoding l
It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shit-register approach leads to a simple proof of the validity of the algorithm as well as providing additional insig...
متن کاملLinear Shift-Register Synthesis for Multiple Sequences of Varying Length
The problem of finding the shortest linear shiftregister capable of generating t finite length sequences over some field F is considered. A similar problem was already addressed by Feng and Tzeng. They presented an iterative algorithm for solving this multi-sequence shift-register synthesis problem, which can be considered as generalization of the well known Berlekamp– Massey algorithm. The Fen...
متن کاملMaximum likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients are endowed with a probabilistic model. Gradient ascent updates to coefficient probabilities are computable using recursions developed by means of the EM algorithm. Reduced-complexity approximations are also developed b...
متن کاملFast multi-sequence shift-register synthesis with the Euclidean algorithm
Feng and Tzeng’s generalization of the Extended Euclidean Algorithm synthesizes the shortest–length linear feedback shift–register for s ≥ 1 sequences, where each sequence has the same length n. In this contribution, it is shown that Feng and Tzeng’s algorithm which solves this multi–sequence shift–register problem has time complexity O(sn2). An acceleration based on the Divide and Conquer stra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1985
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0214038